Practical Efficient Modular Linear-Time Model-Checking
نویسندگان
چکیده
This paper shows how the modular structure of composite systems can guide the state-space exploration in explicit-state linear-time model-checking and make it more efficient in practice. Given a composite system where every module has input and output variables — and variables of different modules can be connected — a total ordering according to which variables are generated is determined, through heuristics based on graph-theoretical analysis of the modular structure. The technique is shown to outperform standard exploration techniques (that do not take the modular structure information into account) by several orders of magnitude in experiments with Spin models of MTL formulas.
منابع مشابه
Efficient Craig Interpolation for Linear Diophantine (Dis)Equations and Linear Modular Equations
The use of Craig interpolants has enabled the development of powerful hardware and software model checking techniques. Efficient algorithms are known for computing interpolants in rational and real linear arithmetic. We focus on subsets of integer linear arithmetic. Our main results are polynomial time algorithms for obtaining proofs of unsatisfiability and interpolants for conjunctions of line...
متن کاملPractical Model Checking of LTL with Past
LTL (Linear Temporal Logic) has become the standard language for linear-time model checking. LTL has only future operators, while it is widely accepted that many specifications are easier, shorter and more intuitive when also past operators are allowed. Moreover, adding past operators does not increase the complexity of LTL model checking, which is still PSPACE-complete. However, model checking...
متن کاملAutomata-theoretic and bounded model checking for linear temporal logic
In this work we study methods for model checking the temporal logic LTL. The focus is on the automata-theoretic approach to model checking and bounded model checking. We begin by examining automata-theoretic methods to model check LTL safety properties. The model checking problem can be reduced to checking whether the language of a finite state automaton on finite words is empty. We describe an...
متن کاملLTL Model Checking for Modular Petri Nets
We consider the problem of model checking modular Petri nets for the linear time logic LTL-X. An algorithm is presented which can use the synchronisation graph from modular analysis as presented by Christensen and Petrucci and perform LTL-X model checking. We have implemented our method in the reachability analyser Maria and performed experiments. As is the case for modular analysis in general,...
متن کاملModel-checking Inherently Fair Linear-time Properties
The concept of linear-time verification with an inherent fairness condition has been studied under the names approximate satisfaction, satisfaction up to liveness, and satisfaction within fairness in several publications. Even though proving the general applicability of the approach, reasonably efficient algorithms for inherently fair linear-time verification (IFLTV) are lacking. This paper bri...
متن کامل